منابع مشابه
Topological paths, cycles and spanning trees in infinite graphs
We study topological versions of paths, cycles and spanning trees in infinite graphs with ends that allow more comprehensive generalizations of finite results than their standard notions. For some graphs it turns out that best results are obtained not for the standard space consisting of the graph and all its ends, but for one where only its topological ends are added as new points, while rays ...
متن کاملComputing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D
The detour and spanning ratio of a graph embedded in measure how well approximates Euclidean space and the complete Euclidean graph, respectively. In this paper we describe time algorithms for computing the detour and spanning ratio of a planar polygonal path. By generalizing these algorithms, we obtain -time algorithms for computing the detour or spanning ratio of planar trees and cycles. Fina...
متن کاملOn Finding and Updating Spanning Trees and Shortest Paths
We consider one origin shortest path and minimum spanning tree computations in weighted graphs. We give a lower bound on the number of analytic functions of the input computed by a tree program which solves either of these problems equal to half the number of worst-case comparisons which well-known algorithms attain. We consider the work necessary to update spanning tree and shortest path solut...
متن کاملComputing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles
The maximum detour and spanning ratio of an embedded graph G are values that measure how well G approximates Euclidean space and the complete Euclidean graph, respectively. In this paper we describe O(n logn) time algorithms for computing the maximum detour and spanning ratio of a planar polygonal path. These algorithms solve open problems posed in at least two previous works [5,10]. We also ge...
متن کاملPaths, Trees and Cycles in Tournaments
We survey results on paths, trees and cycles in tournaments. The main subjects are hamiltonian paths and cycles, vertex and arc disjoint paths with prescribed endvertices, arc-pancyclicity, oriented paths, trees and cycles in tournaments. Several unsolved problems are included.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2013
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.03.018